Practical distributed vehicle routing for street-level map scanning
نویسندگان
چکیده
We present a four-stage meta-heuristic for routing vehicles in an urban environment, with the goal of traversing every street. While the theoretical aspects of street traversal are well-studied, our algorithm is designed to accommodate several obstacles to practical street traversal that are known to be NP-hard, such as turning penalties, the usage of multiple vehicles, and the presence of oneway and two-way streets. We then present some encouraging results from a case study provided by an industrial affiliate.
منابع مشابه
A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
متن کاملA Vehicle Routing Problem with Inventory in a Hybrid Uncertain Environment
Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...
متن کاملTowards ITS Map Database Interoperability-Database Error and Rectification
One of the impediments to the implementation of ITS is the lack of map database interoperability. Centreline databases are available from a number of sources, but few were designed specifically for ITS. Consequently there are a variety of problems — coordinate inaccuracy, errors of omission and commission, missing or wrong street names, incorrect topology — that are compounded when communicatin...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملA Vehicle Routing Problem for Modeling Home Healthcare: a Case Study
Compared to center-based hemodialysis (HD), peritoneal dialysis (PD) has many advantages among which cost effectiveness and comfort of patients are the most important ones. On the other hand the number of PD patients is so small and even decreasing worldwide due to difficulties of this mode of dialysis. Therefore to encourage dialysis patients to choose PD, health system must provide a proper s...
متن کامل